Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice
نویسندگان
چکیده
منابع مشابه
Lattice-free sets, branching disjunctions, and mixed-integer programming
In this paper we study the relationship between valid inequalities for mixed-integer sets, lattice-free sets associated with these inequalities and structured disjunctive cuts, especially the t-branch split cuts introduced by Li and Richard (2008). By analyzing n-dimensional lattice-free sets, we prove that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set wit...
متن کاملInteger Sum Sets Containing Long Arithmetic Progressions
the Schnirelmann and lower asymptotic densities respectively of d. According to Schnirelmann theory (see [9]), if 1 > as/ > 0 and Oes/ then a(2s/) ^ 2a(s/)-a(s/) > a(s/); and if a(s/)^\ then 2s/ = No. From this it follows that if as/ > 0 then there exists a positive integer k such that s/ is a basis of order k (that is, ks/ = No). According to Kneser's theorem [6], if dsf > 0 and Oes/ then eith...
متن کاملSum-free Sets of Integers
A set S of integers is said to be sum-free if a, b e 5 implies a + b 6 S. In this paper, we investigate two new problems on sum-free sets: (1) Let f(k) denote the largest positive integer for which there exists a partition of (1, 2,... ,f(k)) into k sum-free sets, and let h(k) denote the largest positive integer for which there exists a partition of {1, 2, . . . , h(k)) into k sets which are su...
متن کاملAn Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form S := {x : π0 ≤ π T x ≤ π0 + 1} called split sets. The set obtained by adding all split cuts is called the split closure, and the split closure is known to be a polyhedron. A split set S has max-facet-width equal to one in the sense that max{π x : x ∈ S}− min{π...
متن کاملSum-Free Sets and Related Sets
A set A of integers is sum-free if A\(A+A) = ;. Cameron conjectured that the number of sum-free sets A f1; : : : ; Ng is O(2 N=2). As a step towards this conjecture, we prove that the number of sets A f1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8895